Hierarchical Building-Block Problems for GA Evaluation
نویسندگان
چکیده
Much research effort in the GA community has been directed at identifying what, if anything, GA’s are good for ([Forrest & Mitchell, 1993], [Goldberg, 1994], [Mitchell et al., 1995]). The building-block hypothesis ([Holland, 1975], [Goldberg, 1989]) directs our attention to problems which exhibit a decomposable structure, and the Royal-Road problems [Mitchell et al. 1992] were a first attempt at formalizing a problem with building-block components. Other models have been proposed since, but it remains unclear how to model (or solve) problems that exhibit interdependency between building-blocks sometimes called ‘linkage’ or ‘cross-talk’. If, for example, the contribution of a building-block is nontrivially dependent on other building-blocks how can it be identified independently? And, if it is not independent, how can it reasonably be called a building-block? This paper offers clarification for the concepts of inter-dependent blocks, or partiallydecomposable problems, and introduces the Hierarchical-IFF (H-IFF) function which provides a canonical example of a class of hierarchical test problems. H-IFF is then used in some preliminary experiments to investigate the GA’s ability to manipulate interdependent building-blocks.
منابع مشابه
Modeling Building-Block Interdependency
The Building-Block Hypothesis appeals to the notion of problem decomposition and the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of GA test problems with a structure based on buildingblocks. Many of these problems use deceptive fitness functions to model interdependency between the bits within a block. However, very few have any model of interdependency...
متن کاملHierarchically-Consistent GA Test Problems
The Building-Block Hypothesis suggests that GAs perform well when they are able to identify above-averagefitness low-order schemata and recombine them to produce higher-order schemata of higher-fitness. We suppose that the recombinative process continues recursively: combining schemata of successively higher orders as search progresses. Historically, attempts to illustrate this intuitively stra...
متن کاملHierarchically Consistent Test Problems for Genetic Algorithms: Summary and Additional Results
This paper gives additional data for experiments presented in previous work on hierarchically consistent test problems. The experiments utilize Hierarchical-if-and-only-if (H-IFF), the basic example of a hierarchically consistent building-block problem, and several variants of H-IFF designed to enable the difficulty of the function to be ‘tuned’. We review the H-IFF function and its variants, a...
متن کاملHierarchically Consistent Test Problems for Genetic Algorithms
The Building-Block Hypothesis suggests that the genetic algorithm (GA) will perform well when it is able to identify above-average-fitness low-order schemata and recombine them to produce higher-order schemata of higher fitness. We suppose that the recombinative process continues recursively, combining schemata of successively higher orders as search progresses. Historically, attempts to illust...
متن کاملTesting the Robustness of the Genetic Algorithm on the Floating Building Block Representation
Recent studies on a oating building block representation for the genetic algorithm (GA) suggest that there are many advantages to using the oating representation. This paper investigates the behavior of the GA on oating representation problems in response to three diierent types of pressures: (1) a reduction in the amount of genetic material available to the GA during the problem solving proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007